10 research outputs found

    Requirements of the SALTY project

    Get PDF
    This document is the first external deliverable of the SALTY project (Self-Adaptive very Large disTributed sYstems), funded by the ANR under contract ANR-09-SEGI-012. It is the result of task 1.1 of the Work Package (WP) 1 : Requirements and Architecture. Its objective is to identify and collect requirements from use cases that are going to be developed in WP 4 (Use cases and Validation). Based on the study and classification of the use cases, requirements against the envisaged framework are then determined and organized in features. These features will aim at guide and control the advances in all work packages of the project. As a start, features are classified, briefly described and related scenarios in the defined use cases are pinpointed. In the following tasks and deliverables, these features will facilitate design by assigning priorities to them and defining success criteria at a finer grain as the project progresses. This report, as the first external document, has no dependency to any other external documents and serves as a reference to future external documents. As it has been built from the use cases studies that have been synthesized in two internal documents of the project, extracts from the two documents are made available as appendices (cf. appen- dices B and C)

    Coordination dans la décision pour les architectures autonomiques à grande échelle

    No full text
    Though autonomic computing has received a lot of attention since itsinception in the early 2000, to date the research has mainlyconsidered relatively small-scale systems. But Kephart recentlyreminded that the main challenges in this area revolve around facingthe inherent decentralisation when going large-scale, which greatlycomplicates often interdependent adaptation decisions. Especially asautonomic computing imposes inevitable time constraints as it de factoimplies a reactive control for adapting. In this paper, we propose adecentralised approach for coordinating the decision-making thatuncouples the exchange and gathering of coordination information onone hand from the coordinated local decision-making on the other hand.This uncoupling allows for these local decisions to be made withoutdelays as they are based upon information gathered previously. Thisapproach is illustrated by a geotracking application for large fleetsof trucks from the SALTY ANR project, and validated through a seriesof simulations demonstrating the adequacy and the good performances ofits various algorithms.Bien que l'informatique autonomique ait fait l'objet d'une attentionconsidérable depuis ses origines au début des années 2000, lesrecherches se sont principalement concentrées jusqu'ici sur dessystèmes à relativement petite échelle. Mais Kephart rappelaitrécemment que les principaux défis dans le domaine sont liés à ladécentralisation inhérente au passage à l'échelle, qui compliquefortement la prise de décisions d'adaptation souvent interdépendantes.D'autant que l'informatique autonomique impose d'inévitablescontraintes temporelles car elle implique de fait un contrôle réactifpour ces adaptations. Nous proposons une nouvelle approchedécentralisée pour la coordination des décisions qui découple cettedernière en deux processus concurrents : l'échange et l'accumulationd'informations de coordination d'une part, et la prise de décisionslocales coordonnées d'autre part. Ce découplage permet de prendresans délai des décisions locales coordonnées en utilisant lesinformations de coordination préalablement accumulées. Cette approcheest illustrée par une application en géolocalisation de grandesflottes de camions du projet ANR SALTY et validée par une série desimulations montrant l'adéquation et les bonnes performances desdifférents algorithmes utilisés.PARIS-BIUSJ-Mathématiques rech (751052111) / SudocSudocFranceF

    Self-stabilizing Mobile Medical Robots Scattering Algorithm

    Get PDF
    The paper is devoted to the possibility of determinate and probabilistic scattering under various assumptions of the state of the locations of medical robots in both fault-tolerance and vulnerable environments. The topicality of the work is due to the need to place medical robots in the coordinate space having disjoint polygons (robot bodies) which is absolutely unacceptable in the case of medical applications. As a limitation it is assumed that the medical robot sees its nearest neighbors and local monitor of multiplicity is functioning, which can determine the situation when robots occupy intersecting spaces. We propose a probabilistic scattering algorithm which describes the initial states of medical robots and the proper transient state algorithm which can predict the movement of robots to a location where they can intersect. It is shown, that when using the algorithm the states and motion algorithms can be estimated in a fault-tolerance (robots do not fail and the medium is stationary) and vulnerable (the robot may fail and the byzantine problem is not solved, the environment changes faster than the robot can react) environments. The estimates for the computational complexity of the algorithm working without the mission planner are given.Работа посвящена возможности детерминированного и вероятностного рассеяния при различных предположениях состояния местоположения медицинских роботов как в безотказной, так и в уязвимой среде. Актуальность работы обусловлена необходимостью размещения медицинских роботов в пространстве координат, имеющие непересекающиеся полигоны (тела роботов), что в случае медицинских приложений абсолютно недопустимо. В качестве ограничений приняты предположения, что медицинский робот видит ближайших соседей и функционирует локальный монитор множественности, который может определять ситуацию, когда роботы занимают пересекающиеся места в пространстве. Предлагается алгоритм вероятностного рассеяния, описывающий исходные состояния медицинских роботов и собственно алгоритм переходных состояний, которые может прогнозировать движение роботов в местоположение, где они могут пересекаться. Показывается, что при использовании алгоритма могут быть оценены состояния и алгоритмы движения как в безотказной среде (роботы не выходят из строя и среда стационарна), так и в уязвимой среде (робот может выйти из строя, не решена Византийская проблема, среда меняется быстрее, чем робот может реагировать). Также приведены оценки по вычислительной сложности алгоритма, работающего без планировщика миссий

    A decentralised solution for coordinating decisions in large-scale autonomic systems

    No full text
    In this paper, we address the large-scale coordination of decisions impacting the consumption of a common shared resource of limited capacity by managed elements. We propose a decentralised token-based scheme, where each token represents a share of the resource. Our token-based protocol is meant to provide statistical guarantees on the average total resource usage and the average lateness of node actions due to the coordination. Experiments with the coordination of 10.000 autonomic managers have shown very good results for large spectrum of parameter values and system’s regimes

    Modern technologies for training future automation engineers

    No full text
    Based on the research of special literature, the article considers the project method as a means of training future automation engineers at the University. Industrial modernization encourages the search for new pedagogical approaches in technical universities, which are aimed at individual development of the individual, creative initiative, independence, the formation of universal skills of future automation engineers to solve problems which arise in life - professional career, self-determination, daily life. Project activity stimulates students’ educational interest, broadens their minds, develops independent work skills: the ability to reveal and formulate a problem, find and select the necessary information, and use it to solve the tasks set. Using the project method in teaching a foreign language allows future automation engineers to use a foreign language to understand and explain their ideas, understand and accept the ideas of foreign specialists. This is one of the best ways to attract students’ attention to language communication and involve them in learning the world around them through a foreign language. The main task for teachers is to raise interest, motivate future automation engineers and involve them in the work environment

    Using Reinforcement Learning for Autonomic Resource Allocation in Clouds: towards a fully automated workflow

    No full text
    International audienceDynamic and appropriate resource dimensioning isa crucial issue in cloud computing. As applications go more andmore 24/7, online policies must be sought to balance performancewith the cost of allocated virtual machines. Most industrialapproaches to date use ad hoc manual policies, such as thresholdbasedones. Providing good thresholds proved to be tricky andhard to automatize to fit every application requirement. Researchis being done to apply automatic decision-making approaches,such as reinforcement learning. Yet, they face a lot of problemsto go to the field: having good policies in the early phasesof learning, time for the learning to converge to an optimalpolicy and coping with changes in the application performancebehavior over time. In this paper, we propose to deal with theseproblems using appropriate initialization for the early stages aswell as convergence speedups applied throughout the learningphases and we present our first experimental results for these.We also introduce a performance model change detection onwhich we are currently working to complete the learning processmanagement. Even though some of these proposals were knownin the reinforcement learning field, the key contribution of thispaper is to integrate them in a real cloud controller and toprogram them as an automated workflow

    Self-Adaptation in Geotracking Applications: Challenges, Opportunities and Models

    No full text
    International audienceGeotracking emerges as a mission-critical mean to observe, track and otherwise manage mobile entities from the regular notification of their geographic locations, thanks to positioning devices such as GPS and cell phones. First used in logistic systems, geotracking now strives for large-scale with new applications like the management continent-wide green tax collection on millions of trucks from their passage through thousands virtual toll points. As the current single device, fixed position notification frequency policies can no longer cope with the stringent requirements of such large-scale applications, this paper first examines the challenges and opportunities for self-adaptation in geotracking systems and applications. After identifying the main requirements to that end, it then provides for a first set of decision-making models for identified self-adaptation scenarii, in the context of a set of everyday geotracking business-oriented applications. Finally, it proposes a set of tools and the software architecture currently developed under the French ANR project SALTY to address these issues in the conceptual framework of autonomic computing

    Requirements of the SALTY project

    No full text
    This document is the first external deliverable of the SALTY project (Self-Adaptive very Large disTributed sYstems), funded by the ANR under contract ANR-09-SEGI-012. It is the result of task 1.1 of the Work Package (WP) 1 : Requirements and Architecture. Its objective is to identify and collect requirements from use cases that are going to be developed in WP 4 (Use cases and Validation). Based on the study and classification of the use cases, requirements against the envisaged framework are then determined and organized in features. These features will aim at guide and control the advances in all work packages of the project. As a start, features are classified, briefly described and related scenarios in the defined use cases are pinpointed. In the following tasks and deliverables, these features will facilitate design by assigning priorities to them and defining success criteria at a finer grain as the project progresses. This report, as the first external document, has no dependency to any other external documents and serves as a reference to future external documents. As it has been built from the use cases studies that have been synthesized in two internal documents of the project, extracts from the two documents are made available as appendices (cf. appen- dices B and C)

    Requirements of the SALTY project

    No full text
    This document is the first external deliverable of the SALTY project (Self-Adaptive very Large disTributed sYstems), funded by the ANR under contract ANR-09-SEGI-012. It is the result of task 1.1 of the Work Package (WP) 1 : Requirements and Architecture. Its objective is to identify and collect requirements from use cases that are going to be developed in WP 4 (Use cases and Validation). Based on the study and classification of the use cases, requirements against the envisaged framework are then determined and organized in features. These features will aim at guide and control the advances in all work packages of the project. As a start, features are classified, briefly described and related scenarios in the defined use cases are pinpointed. In the following tasks and deliverables, these features will facilitate design by assigning priorities to them and defining success criteria at a finer grain as the project progresses. This report, as the first external document, has no dependency to any other external documents and serves as a reference to future external documents. As it has been built from the use cases studies that have been synthesized in two internal documents of the project, extracts from the two documents are made available as appendices (cf. appen- dices B and C)
    corecore